A new inductive approach to the lace expansion for self- avoiding walks
نویسندگان
چکیده
We introduce a new inductive approach to the lace expansion and apply it to prove Gaussian behaviour for the weakly self avoiding walk on Zd where loops of length m are penalised by a factor e m p when d p d p d In particular we derive results rst obtained by Brydges and Spencer and revisited by other authors for the case d p In addition we prove a local central limit theorem with the exception of the case d p Mathematics Subject Classi cation B K
منابع مشابه
The lace expansion on a tree with application to networks of self-avoiding walks
The lace expansion has been used successfully to study the critical behaviour in high dimensions of self-avoiding walks, lattice trees and lattice animals, and percolation. In each case, the lace expansion has been an expansion along a time interval. In this paper, we introduce the lace expansion on a tree, in which ‘time’ is generalised from an interval to a tree. We develop the expansion in t...
متن کاملPolygons and the Lace Expansion
We give an introduction to the lace expansion for self-avoiding walks, with emphasis on self-avoiding polygons, and with a focus on combinatorial rather than analytical aspects. We derive the lace expansion for self-avoiding walks, and show that this is equivalent to taking the reciprocal of the self-avoiding walk generating function. We list some of the rigorous results for self-avoiding walks...
متن کاملA Self-avoiding Walk with Attractive Interactions
A powerful tool for the study of self-avoiding walks is the lace expansion of Brydges and Spencer [BS]. It is applicable above four dimensions and shows the mean-field behavior of self-avoiding walks, that is, critical exponents are those of the simple random walk. An extensive survey of random walks can be found in [MS]. The lace expansion was originally introduced for weakly self-avoiding wal...
متن کاملSelf-avoiding walk enumeration via the lace expansion
We introduce a new method for the enumeration of self-avoiding walks based on the lace expansion. We also introduce an algorithmic improvement, called the two-step method, for self-avoiding walk enumeration problems. We obtain significant extensions of existing series on the cubic and hypercubic lattices in all dimensions d ≥ 3: we enumerate 32-step self-avoiding polygons in d = 3, 26-step self...
متن کاملHigh-dimensional graphical networks of self-avoiding walks
We use the lace expansion to analyse networks of mutually-avoiding self-avoiding walks, having the topology of a graph. The networks are defined in terms of spread-out self-avoiding walks that are permitted to take large steps. We study the asymptotic behaviour of networks in the limit of widely separated network branch points, and prove Gaussian behaviour for sufficiently spread-out networks o...
متن کامل